Problem set

Results: 1590



#Item
431

Name: Problem Set 2 Math 4281, Spring 2014 Due: Wednesday, February 5 Complete the following items, staple this page to the front of your work, and turn your assignment

Add to Reading List

Source URL: www-users.math.umn.edu

Language: English - Date: 2014-03-07 10:44:19
    432

    CSCI-UA: Theory of Computation Problem Set 4 All problems are worth 10 points. Collaboration is allowed, but you must write your own solutions. Write the names of your collaborators (and your own!). Unless state

    Add to Reading List

    Source URL: ftp.cs.nyu.edu

    Language: English - Date: 2013-11-05 11:00:26
      433Graph theory / Mathematics / Computational complexity theory / NP-complete problems / Dominating set / Independent set / Vertex cover / Connected dominating set / Set cover problem / Line graph / Metric k-center / Domatic number

      Approximating Fault-Tolerant Domination in General Graphs Klaus-Tycho Foerster∗ Abstract In this paper we study the NP-complete problem of finding small k-dominating sets in general graphs, which allow k − 1 nodes to

      Add to Reading List

      Source URL: www.tik.ee.ethz.ch

      Language: English - Date: 2015-05-18 12:16:23
      434

      CS172 Computability & Complexity (Spring’09) Instructor: Mihai Pˇatra¸scu Problem Set 5 GSI: Omid Etesami

      Add to Reading List

      Source URL: www-inst.eecs.berkeley.edu

      Language: English - Date: 2009-03-04 16:55:07
        435

        CSCI-UA: Theory of Computation Problem Set 1 For this problem set, the alphabet is Σ = {0, 1} unless otherwise specified. All problems are worth 10 points. Collaboration is allowed, but you must write your own

        Add to Reading List

        Source URL: ftp.cs.nyu.edu

        Language: English - Date: 2013-09-20 09:13:49
          436

          Name: Problem Set 9 Math 4281, Spring 2014 Due: Wednesday, April 2

          Add to Reading List

          Source URL: www-users.math.umn.edu

          Language: English - Date: 2014-03-10 16:52:04
            437

            MATH 592 SPRING 2010 TOPICS IN ERGODIC THEORY PROBLEM SET 4 1. Show that T is ergodic if and only if the only T-invariant measurable functions are the functions which are constant almost everywhere. 2. Show that the map

            Add to Reading List

            Source URL: www.juliawolf.org

            Language: English - Date: 2012-10-17 04:27:57
              438

              Name: Problem Set 10 Math 4281, Fall 2013 Due: Friday, November 15 Read Sections 3.3, 4.1, 5.1, and 5.2 in your textbook.

              Add to Reading List

              Source URL: www-users.math.umn.edu

              Language: English - Date: 2013-11-04 11:47:15
                439

                Zollman NASSLLI (Tuesday): Problem set 2 Problem 1

                Add to Reading List

                Source URL: www.andrew.cmu.edu

                Language: English - Date: 2015-10-22 14:27:36
                  440

                  PY 542: Non-Equilibrium Statistical Physics Problem Set 9, Fall 2011 Reading: This week we continue with the dynamics of the Ising-Glauber model. I’ll then turn to the voter model, and finally to spin-exchange dynamic

                  Add to Reading List

                  Source URL: physics.bu.edu

                  - Date: 2011-11-04 20:16:11
                    UPDATE